package com.lintcode.solution;

public class Solution_56 {
    public static void main(String[] agrs) {
        int[] nums = {};
    }
    
    public static int[] twoSum(int[] numbers, int target) {
        int[] result = new int[ 2 ];
        for (int i = 0; i < numbers.length - 1; i++) {
            for (int j = i + 1; j < numbers.length; j++) {
                if (numbers[ i ] + numbers[ j ] == target) {
                    result[ 0 ] = i;
                    result[ 1 ] = j;
                    break;
                }
            }
        }
        return result;
    }
    
}
